Set-merging for the Matching Algorithm of Micali and Vazirani
نویسنده
چکیده
The algorithm of Micali and Vazirani [4] finds a maximum cardinality matching in time O( √ nm) if an efficient set-merging algorithm is used. The latter is provided by the incrementaltree set-merging algorithm of [2]. Details of this application to matching were omitted from [2] and are presented in this note.
منابع مشابه
A Simplification of the MV Matching Algorithm and its Proof
For all practical purposes, the Micali-Vazirani [MV80] general graph maximum matching algorithm is still the most efficient known algorithm for the problem. The purpose of this paper is to provide a complete proof of correctness of the algorithm in the simplest possible terms; graph-theoretic machinery developed for this purpose also helps simplify the algorithm.
متن کاملA Proof of the MV Matching Algorithm
This paper gives the first complete proof of correctness of the Micali-Vazirani [MV80] general graph maximum cardinality matching algorithm. Our emphasis is on arriving at the simplest possible proof; graph-theoretic machinery developed for this purpose also helps simplify the description of this algorithm. For all practical purposes, this is still the most efficient known algorithm for the pro...
متن کاملExtending Search Phases in the Micali-Vazirani Algorithm
The Micali-Vazirani algorithm is an augmenting path algorithm that offers the best theoretical runtime of O(n0.5m) for solving the maximum cardinality matching problem for non-bipartite graphs. This paper builds upon the algorithm by focusing on the bottleneck caused by its search phase structure and proposes a new implementation that improves efficiency by extending the search phases in order ...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملBalanced network flows. I. A unifying framework for design and analysis of matching algorithms
We discuss a wide range of matching problems in terms of a network flow model. More than this, we start up a matching theory which is very intuitive and independent from the original graph context. This first paper contains a standardized theory for the performance analysis of augmentation algorithms in a wide area of matching problems. Several optimality criteria are given which do not use cut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1501.00212 شماره
صفحات -
تاریخ انتشار 2014